A statistical approach to SENSE regularization with arbitrary k-space trajectories.
نویسندگان
چکیده
SENSE reconstruction suffers from an ill-conditioning problem, which increasingly lowers the signal-to-noise ratio (SNR) as the reduction factor increases. Ill-conditioning also degrades the convergence behavior of iterative conjugate gradient reconstructions for arbitrary trajectories. Regularization techniques are often used to alleviate the ill-conditioning problem. Based on maximum a posteriori statistical estimation with a Huber Markov random field prior, this study presents a new method for adaptive regularization using the image and noise statistics. The adaptive Huber regularization addresses the blurry edges in Tikhonov regularization and the blocky effects in total variation (TV) regularization. Phantom and in vivo experiments demonstrate improved image quality and convergence speed over both the unregularized conjugate gradient method and Tikhonov regularization method, at no increase in total computation time.
منابع مشابه
Parallel spectroscopic imaging reconstruction with arbitrary trajectories using k-space sparse matrices.
Parallel imaging reconstruction has been successfully applied to magnetic resonance spectroscopic imaging (MRSI) to reduce scan times. For undersampled k-space data on a Cartesian grid, the reconstruction can be achieved in image domain using a sensitivity encoding (SENSE) algorithm for each spectral data point. Alternative methods for reconstruction with undersampled Cartesian k-space data are...
متن کاملAdvances in sensitivity encoding with arbitrary k-space trajectories.
New, efficient reconstruction procedures are proposed for sensitivity encoding (SENSE) with arbitrary k-space trajectories. The presented methods combine gridding principles with so-called conjugate-gradient iteration. In this fashion, the bulk of the work of reconstruction can be performed by fast Fourier transform (FFT), reducing the complexity of data processing to the same order of magnitud...
متن کاملSPIRiT: Iterative self-consistent parallel imaging reconstruction from arbitrary k-space.
A new approach to autocalibrating, coil-by-coil parallel imaging reconstruction, is presented. It is a generalized reconstruction framework based on self-consistency. The reconstruction problem is formulated as an optimization that yields the most consistent solution with the calibration and acquisition data. The approach is general and can accurately reconstruct images from arbitrary k-space s...
متن کاملSimplified Iterative GRAPPA for fast and robust parallel MRI with arbitrary trajectories
Introduction: General formulations for parallel MRI using arbitrary k-space trajectories are mainly based on iterative algorithms, such as CG-SENSE [1]. In addition, an iterative GRAPPA approach for arbitrary k-space sampling has been presented [2]. However, the reconstruction process includes several steps, including gridding, GRAPPA convolution and re-sampling operations during each iteration...
متن کاملSpiral SENSE: Sensitivity Encoding with arbitrary K-space Trajectories
Introduction Recently, sensitivity encoding with coil arrays has been discussed as a means of reducing acquisition time in standard Fourier imaging. The SENSE concept (1) combines reduced gradient encoding with the consideration of spatially distinct receiver sensitivities for signal localization. With rectilinear sampling patterns in k-space image reconstruction from sensitivity encoded data m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Magnetic resonance in medicine
دوره 60 2 شماره
صفحات -
تاریخ انتشار 2008